Planning and Design Methods for Robust WDM Networks subject to Traffic Changes

Many researches have been investigated on planning or designing WDM networks assuming that the future traffic is known beforehand. Practically, it is difficult to predict the future traffic demand accurately since there are various types of data traffic with different traffic characteristics. In this thesis, we propose a scheme to design a WDM network that will accommodate as much traffic as possible against a variety of traffic patterns, that is, robust WDM network. Our straightforward way to meet this objective is to design a network to maximize the volume of future traffic flow. To achieve this simply, we divide the WDM network design problem into two subproblems, the OXC–deployment problem and the fiber–deployment problem. In both problems, we propose schemes to maximize the volume of traffic demand that can be accommodated in the future by taking into account the maximum flow value of each node–pair. We handle those problems by incrementally extending network resources based on the ADD algorithm. By deploying network resources until they reach a condition that a robust WDM network needs to fulfill, we can design a robust WDM network. We compare our proposed scheme with the existing method using various traffic matrices. The results show that the WDM network designed by our method accommodates all the traffic demand, while the one, designed by the exisiting method with the same cost, cannot accommodate 20% of the traffic demand. 1